Asymmetric guessing games
نویسندگان
چکیده
This paper theoretically and experimentally investigates the behavior of asymmetric players in guessing games. The asymmetry is created by introducing $$r>1$$ replicas one players. Two-player restricted N-player cases are examined detail. Based on model parameters, equilibrium either unique which all choose zero or mixed weak player ( $$r=1$$ ) imitates strong ). A series experiments involving two three-player repeated games with conducted. We find that observed less frequently overall choices farther from two-player contrast to symmetric games, but this not case Convergence towards exists slows down speed convergence two, Furthermore, have a slight earning advantage over players, increases discrepancy (defined as squared distance winning number) both
منابع مشابه
Guessing Games
In a guessing game, players guess the value of a random real number selected using some probability density function. The winner may be determined in various ways; for example, a winner can be a player whose guess is closest in magnitude to the target, or a winner can be a player coming closest without guessing higher than the target. We study optimal strategies for players in these games and d...
متن کاملHat Guessing Games
Hat problems have become a popular topic in recreational mathematics. In a typical hat problem, each of n players tries to guess the color of the hat they are wearing by looking at the colors of the hats worn by some of the other players. In this paper we consider several variants of the problem, united by the common theme that the guessing strategies are required to be deterministic and the ob...
متن کاملUnraveling in Guessing Games: An Experimental Study
Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at http://www.jstor.org/about/terms.html. JSTOR's Terms and Conditions of Use provides, in part, that unless you have obtained prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive only for your perso...
متن کاملGraph Entropy, Network Coding and Guessing games
We introduce the (private) entropy of a directed graph (in a new network coding sense) as well as a number of related concepts. We show that the entropy of a directed graph is identical to its guessing number and can be bounded from below with the number of vertices minus the size of the graph’s shortest index code. We show that the Network Coding solvability of each specific multiple unicast n...
متن کاملA New Variation of Hat Guessing Games
Several variations of hat guessing games have been popularly discussed in recreational mathematics. In a typical hat guessing game, after initially coordinating a strategy, each of n players is assigned a hat from a given color set. Simultaneously, each player tries to guess the color of his/her own hat by looking at colors of hats worn by other players. In this paper, we consider a new variati...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theory and Decision
سال: 2022
ISSN: ['1573-7187', '0040-5833']
DOI: https://doi.org/10.1007/s11238-022-09908-6